Zorn’s Lemma and Some Applications
نویسنده
چکیده
Zorn’s lemma is a result in set theory that appears in proofs of some non-constructive existence theorems throughout mathematics. We will state Zorn’s lemma below and use it in later sections to prove some results in linear algebra, ring theory, and group theory. In an appendix, we will give an application to metric spaces. The statement of Zorn’s lemma is not intuitive, and some of the terminology in it may be unfamiliar, but after reading through the explanation of Zorn’s lemma and then the proofs that use it you should be more comfortable with how it can be applied.
منابع مشابه
Some Applications of Zorn’s Lemma in Algebra
We indicate some new applications of Zorn’s Lemma to a number of algebraic areas. Specifically, we show that a property P holds for all the subobjects of a given object if and only if P supports both the chain condition from Zorn’s Lemma and some finitistic conditions on subobjects that have the flavor of mathematical induction. The specific algebraic contexts considered are modules, sets, grou...
متن کاملTychonoff’s theorem as a direct application of Zorn’s lemma
A simple proof of Tychonoff’s theorem (the compactness of the product of compact spaces) as a direct application of Zorn’s lemma is given. In contrast to the classical Cartan-Bourbaki proof which uses Zorn’s lemma twice, our proof uses it only once.
متن کاملThe Axiom of Choice, the Well Ordering Principle and Zorn’s Lemma
In this note we prove the equivalence between the axiom of choice, the well ordering principle and Zorn’s lemma, and discuss to some extent how large fragment of ZF we need in order to prove the individual implications.
متن کامل9. the Axiom of Choice and Zorn’s Lemma
§9.1 The Axiom of Choice We come now to the most important part of set theory for other branches of mathematics. Although infinite set theory is technically the foundation for all mathematics, in practice it is perfectly valid for a mathematician to ignore it – with two exceptions. Of course most of the basic set constructions as outlined in chapter 2 (unions, intersections, cartesian products,...
متن کاملExercises for Higher Algebra
(1) Let R be a division ring. Prove that every module over R is free. You will need to use Zorn’s lemma: Recall that a partially order set (=poset) S is a set with a relation x ≤ y defined between some pairs of elements x, y ∈ S, such that: (i) x ≤ x ; (ii) x ≤ y and y ≤ x implies x = y ; (iii) x ≤ y , y ≤ z ⇒ x ≤ z . A chain in S is a subset T ⊂ S such that for all t, t ′ in T , either t ≤ t ′...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009